Algorithm for dynamic route assignment in complex street layouts

Dynamic Layouts for Wireless ATM

Route Assignment for Autonomous Vehicles

We demonstrate a self-organizing, multi-agent system to generate approximate solutions to the route assignment problem for a large number of vehicles across many origins and destinations. Our algorithm produces a set of mixed strategies over the set of paths through the network, which are suitable for use by autonomous vehicles in the absence of centralized control or coordination. Our approach...

A Randomized Algorithm for Label Assignment in Dynamic Networks

A basic problem in distributed computing has to do with assigning unique labels – that is,names or addresses – to network elements. Some approaches to solving this problem includeusing static assignment (e.g., MAC addresses), or using a centralized authority (e.g., DHCP).In this paper, we present an approach that is suitable for dynamic environments: where therules constraining ...

A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks

Wavelength Division Multiplexing (WDM) technology provides a wideband communication networks by realizing multiple communication channels with different wavelengths on a single optical fiber. In this technology, each node (wavelength router) has a finite number of transmitters/receivers dealing with different wavelengths, where each wavelength is exclusively used for the communication channel b...

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...